Abstract — This work addresses the feedback capacity of compound channels with memory. We provide an upper bound on the feedback capacity of a compound finite-state channel. As a consequence, we show that for a stationary channel with memory, if the compound channel capacity is zero without feedback then it is zero with feedback. Additionally, we show that feedback does not increase the capacity of the compound Gilbert-Elliot channel. I
The main goal for the communication engineer is to design the encoder and decoder so that the system...
We consider discrete channels with stationary additive noise. We show that output feedback does not ...
Abstract—In this paper, we consider the discrete, time-varying broadcast channel (BC) with memory un...
In this work, we find the capacity of a compound finite-state channel (FSC) with time-invariant dete...
We consider discrete channels with arbitrary additive noise. Note that such channels need not be mem...
Abstract—We study the capacity of indecomposable finite-state channels (IFSCs) with feedback. It is ...
A coding theorem is proved for memoryless channels when the channel state feedback of finite cardina...
A coding theorem is proved for memoryless channels when the channel state feedback of finite cardina...
Abstract—The capacity region of the finite-state multiple-access channel (FS-MAC) with feedback that...
We provide a single letter characterization of the capacity region for independent, identically dist...
Abstract—The capacity region of the finite-state multiple-access channel (FS-MAC) with feedback that...
It is known that for a discrete channel with correlated additive noise, the ordinary capacity with o...
Abstract: We consider some properties of the finite block length capacity Cn,FB(P) of the discrete t...
Abstract—We consider a class of finite-state Markov channels with feedback. We first introduce a sim...
The main concerns of this thesis are some special families of channels with memory, which are of gre...
The main goal for the communication engineer is to design the encoder and decoder so that the system...
We consider discrete channels with stationary additive noise. We show that output feedback does not ...
Abstract—In this paper, we consider the discrete, time-varying broadcast channel (BC) with memory un...
In this work, we find the capacity of a compound finite-state channel (FSC) with time-invariant dete...
We consider discrete channels with arbitrary additive noise. Note that such channels need not be mem...
Abstract—We study the capacity of indecomposable finite-state channels (IFSCs) with feedback. It is ...
A coding theorem is proved for memoryless channels when the channel state feedback of finite cardina...
A coding theorem is proved for memoryless channels when the channel state feedback of finite cardina...
Abstract—The capacity region of the finite-state multiple-access channel (FS-MAC) with feedback that...
We provide a single letter characterization of the capacity region for independent, identically dist...
Abstract—The capacity region of the finite-state multiple-access channel (FS-MAC) with feedback that...
It is known that for a discrete channel with correlated additive noise, the ordinary capacity with o...
Abstract: We consider some properties of the finite block length capacity Cn,FB(P) of the discrete t...
Abstract—We consider a class of finite-state Markov channels with feedback. We first introduce a sim...
The main concerns of this thesis are some special families of channels with memory, which are of gre...
The main goal for the communication engineer is to design the encoder and decoder so that the system...
We consider discrete channels with stationary additive noise. We show that output feedback does not ...
Abstract—In this paper, we consider the discrete, time-varying broadcast channel (BC) with memory un...